Random walk on a population of random walkers
نویسندگان
چکیده
منابع مشابه
A Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملRandom walk on random walks
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density ρ ∈ (0,∞). At each step the random walk performs a nearest-neighbour jump, moving to the right with probability p◦ when it is on a vacant site and probability p• when it is on an oc...
متن کاملPopulation pharmacokinetics of omeprazole in a random Iranian population
Background: Omeprazole is metabolized predominantly by CYP2C19, a polymorphically expressed enzymes that show marked interindividual and interethnic variation. These variations cause a substantial differences that have been reported in the pharmacokinetics of omeprazole. The aim of the present study was to evaluate the pharmacokinetic parameters of omeprazole in a random Iranian population. Met...
متن کاملa random walk with exponential travel times
consider the random walk among n places with n(n - 1)/2 transports. we attach an exponential random variable xij to each transport between places pi and pj and take these random variables mutually independent. if transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملRandom walk on a polygon
Abstract: A particle moves among the vertices of an (m + 1)-gon which are labeled clockwise as 0, 1, . . . , m. The particle starts at 0 and thereafter at each step it moves to the adjacent vertex, going clockwise with a known probability p, or counterclockwise with probability 1 − p. The directions of successive movements are independent. What is the expected number of moves needed to visit al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2007
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/41/1/015001